Feasibility Analysis of Non-Preemptive Periodic Systems from Infeasibility Perspective
نویسندگان
چکیده
منابع مشابه
Runtime feasibility check for non-preemptive real-time periodic tasks
The most important requirement for real-time systems is the capability to support the timely execution of applications. Real-time scheduling over a single processor has been widely studied in the last thirty years, and it has been proven that the non-preemptive version of Earliest Deadline First (EDF) algorithm is optimal [1], in the sense that if a set of tasks is schedulable, it is also sched...
متن کاملInfeasibility Analysis for Linear Systems, a Survey
We discuss infeasibility analysis (study of changes needed to make an infeasible system feasible) for systems of linear constraints.
متن کاملOn Non-Preemptive Scheduling of Periodic and Sporadic Tasks
This paper examines a fundamental problem in the theory of real-time scheduling, that of scheduling a set of periodic or sporadic tasks on a uniprocessor without preemption and without inserted idle time. We exhibit a necessary and sufficient set of conditions C for a set of periodic or sporadic tasks to be schedulable for arbitrary release times of the tasks. We then show that any set of perio...
متن کاملNon-preemptive multiprocessor scheduling of strict periodic systems with precedence constraints
We evoke our model of strict periodic systems with precedence constraints and our model of architecture. We prove that the problem of multiprocessor scheduling of these systems is NP-hard. We give some theoretical results which allows us to propose a heuristic to solve this problem and we compare its performances to those of an exact algorithm of type “branch & bound”.
متن کاملPropagation mechanism for a non-preemptive strictly periodic scheduling problem
We study a non-preemptive strictly periodic scheduling problem. This problem, introduced in [6, 4], arises for example in the avionic field where a set of N periodic tasks (measure of a sensor, etc.) has to be scheduled on P processors distributed on the plane. In the related field of cyclic scheduling [5], some notable success [3] has been recently achieved through the use of specific constrai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science
سال: 2019
ISSN: 1549-3636
DOI: 10.3844/jcssp.2019.1283.1290